Efficient heuristic solutions for wireless communication systems
نویسندگان
چکیده
Recent years have witnessed tremendous developments regarding wireless network access. In this paper emphasis is given to methods for the design of in-door Coded Division Multiple Access (CDMA) based wireless networks and Fixed Wireless (e.g. Wireless Local Loop WLL) networks, which are referred to as wireless access networks. In these networks, two main types of network components are considered: the access point/base station and the fixed wireless user/terminal. The fixed wireless terminals (test points) claim for access to the network and the access points/base stations connect the terminals to the network. With the set T of fixed wireless terminals and the set S of possible (predefined) locations for the placement of access points/base stations. Each terminal i ∈ T should be connected to only one access point/base station j ∈ S and each access point/base station together with its associated terminals, constitute an access subnetwork. Moreover, the access points/base stations can be connected to one or more other subnetworks (e.g. the backbone subnetwork). A typical network that includes wireless access subnetworks is illustrated in Figure 1. The process of wireless network planning basically consists of two phases: 1. Base station placement. A number of base stations must be placed in a number of (predefined) candidate sites, essentially one base station in each selected site. 2. Wireless terminal (test point) allocation to the selected base station(s) in phase 1. Practically, both phases can be considered as one. However, the design cost that here refers to base station placement (installation) and operation, should be minimum. Unfortunately, today there are no systematic methods to address the problem of wireless network planning, especially for CDMA based networks, fixed wireless and UMTS access networks. In fact, the planning process is mainly based on empirical approaches [1]. Nevertheless, recent design approaches [2, 3], based on Integer Linear Programming (ILP) and Mixed Integer Programming (MIP) techniques, deal with the above problem in a rather interesting way that it may be very advantageous in practice. A wireless system planning procedure for in-door CDMA networks based on a complex ILP model is presented in [2]. However, no simulation results regarding topologies with more than 27 wireless users are provided. In [3] a series of complex MIP optimization models specially suited for UMTS base station planning are presented. Figure 1. Typical network example
منابع مشابه
Design of a novel congestion-aware communication mechanism for wireless NoC architecture in multicore systems
Hybrid Wireless Network-on-Chip (WNoC) architecture is emerged as a scalable communication structure to mitigate the deficits of traditional NOC architecture for the future Multi-core systems. The hybrid WNoC architecture provides energy efficient, high data rate and flexible communications for NoC architectures. In these architectures, each wireless router is shared by a set of processing core...
متن کاملEvolutionary Computing Assisted Wireless Sensor Network Mining for QoS-Centric and Energy-efficient Routing Protocol
The exponential rise in wireless communication demands and allied applications have revitalized academia-industries to develop more efficient routing protocols. Wireless Sensor Network (WSN) being battery operated network, it often undergoes node death-causing pre-ma...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملOn Integrated Ant Colony Optimization Strategies for Improved Channel Allocation in Large Scale Wireless Communications
Recently, various sophisticated strategies adapted to current network conditions have been proposed for channel allocation based on intelligent techniques such as evolutionary and genetic algorithms. These approaches constitute heuristic solutions to resource management problems in modern cellular systems. On the other hand, the ant colony optimization approach has been proposed for solving sev...
متن کاملEfficient Heuristic Solutions for Wireless Communication Systems Planning
This paper presents two novel heuristic algorithms for the design of wireless access networks laying special emphasis to the design of indoor CDMA based and Fixed Wireless networks. Both methods are based on Graph Theory and they are essentially greedy algorithms. The first objective of the two heuristics is to place a number of access points/base stations in a number of candidate sites and the...
متن کامل